A Linear Time Algorithm for Finding a k-Tree Core
نویسندگان
چکیده
Given a tree containing n vertices, consider the sum of the distance between all vertices and a k-leaf-subtree (subtree which contains exactly k leaves). A k-tree-core is a k-leaf-subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for nding a k-tree-core for a given k.
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملیک الگوریتم خطی برای مساله ی پیداکردن هسته ی درخت های بازه ای وزندار
In this paper we consider the problem of finding a core of weighted interval trees. A core of an interval graph is a path contains some intervals of graph so that the sum of distances from all intervals to this path is minimized. We show that intervals on core of a tree should be maximal, then a linear time algorithm is presented to find the core of interval trees
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملEfficient algorithms for a constrained k-tree core problem in a tree network
Let T = (V ,E) be a free tree in which each vertex has a weight and each edge has a length. Let n = |V |. Given T and parameters k and l, a (k, l)-tree core is a subtree X of T with diameter l, having k leaves, which minimizes the sum of the weighted distances from all vertices in T to X. In this paper, two efficient algorithms are presented for finding a (k, l)-tree core of T . The first algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 23 شماره
صفحات -
تاریخ انتشار 1997